Overlap-freeness in infinite partial words
نویسندگان
چکیده
منابع مشابه
Overlap-freeness in infinite partial words
10 We prove that there exist infinitely many infinite overlap-free binary partial words. 11 Moreover, we show that these words can contain only one hole and the hole must 12 occur either in the first or in the second position. We define that a partial word is 13 k-overlap-free if it does not contain a factor of the form xyxyx where the length 14 of x is at least k. We prove that there exist inf...
متن کاملFreeness of partial words
The paper approaches the classical combinatorial problem of freeness of words, in the more general case of partial words. First, we propose an algorithm that tests efficiently whether a partial word is kfree or not. Then, we show that there exist arbitrarily many cube-free infinite partial words containing an infinite number of holes, over binary alphabets; thus, there exist arbitrarily many k-...
متن کاملRecurrence in infinite partial words
The recurrence function Rw(n) of an infinite word w was introduced by Morse and Hedlund in relation to symbolic dynamics. It is the size of the smallest window such that, wherever its position on w, all length n subwords of w will appear at least once inside that window. The recurrence quotient ρ(w) of w, defined as lim sup Rw(n) n , is useful for studying the growth rate of Rw(n). It is known ...
متن کاملExtremal Infinite Overlap-Free Binary Words
Let t be the infinite fixed point, starting with 1, of the morphism μ : 0 → 01, 1→ 10. An infinite word over {0, 1} is said to be overlap-free if it contains no factor of the form axaxa, where a ∈ {0, 1} and x ∈ {0, 1}∗. We prove that the lexicographically least infinite overlap-free binary word beginning with any specified prefix, if it exists, has a suffix which is a suffix of t. In particula...
متن کاملLength-k-overlap-free Binary Infinite Words
We study length-k-overlap-free binary infinite words, i.e., binary infinite words which can contain only overlaps xyxyx with |x| ≤ k− 1. We prove that no such word can be generated by a morphism, except if k = 1. On the other hand, for every k ≥ 2, there exist length-k-overlap-free binary infinite words which are not length-(k−1)-overlap-free. As an application, we prove that, for every non-neg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.12.041